THE LINK BETWEEN REGULARITY AND STRONG-PI-REGULARITY

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The distance between regularity and strong regularity ∗

In this paper we give very sharp bounds for the distance between regularity and strong regularity. The solution of this problem uses a general matrix analogue [18] of the Perron-Frobenius Theory. This theory has been graded as a challenge problem for future research by the International Linear Algebra Society [7]. An interval matrix [A] ∈ IIMn(IR) is called regular, if every A ∈ [A] is nonsingu...

متن کامل

Strong Topological Regularity and Weak Regularity of Banach Algebras

In this article we study two different generalizations of von Neumann regularity, namely strong topological regularity and weak regularity, in the Banach algebra context. We show that both are hereditary properties and under certain assumptions, weak regularity implies strong topological regularity. Then we consider strong topological regularity of certain concrete algebras. Moreover we obtain ...

متن کامل

strong topological regularity and weak regularity of banach algebras

in this article we study two different generalizations of von neumann regularity, namely strong topological regularity and weak regularity, in the banach algebra context. we show that both are hereditary properties and under certain assumptions, weak regularity implies strong topological regularity. then we consider strong topological regularity of certain concrete algebras. moreover we obtain ...

متن کامل

On the Interplay Between Strong Regularity and Graph Densification

In this paper we analyze the practical implications of Szemerédi’s regularity lemma in the preservation of metric information contained in large graphs. To this end, we present a heuristic algorithm to find regular partitions. Our experiments show that this method is quite robust to the natural sparsification of proximity graphs. In addition, this robustness can be enforced by graph densification.

متن کامل

Proving Regularity and Non-regularity

This does not make it look any easier to use; it makes it look even more foreboding. However, it is useful for the following reason. To use the pumping lemma to show that L is not regular, you have to show it does not satisfy the pumping lemma. Therefore you have to show that the NEGATION of the conclusion of the lemma is true. If you can intuitively understand how to form the negation of a log...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society

سال: 2010

ISSN: 1446-7887,1446-8107

DOI: 10.1017/s1446788710001448